Reachability problems in BioAmbients
نویسندگان
چکیده
منابع مشابه
Reachability problems in BioAmbients
BioAmbients (BA) is a powerful model for representing various aspects of living cells. The model provides a rich set of operations for the movement and interaction of molecules. The richness of the language motivates the study of fragments of the full model and the comparison with other computational models. In this paper, we investigate the impact of the merge capability, used for fusing the c...
متن کاملOn Reachability and Spatial Reachability in Fragments of BioAmbients
BioAmbients is a powerful model for representing various aspects of living cells. The model provides a rich set of operations for the movement and interaction of molecules. The richness of the language motivates the study of dialects of the full model and the comparison with other computational models. In this paper we investigate the limit between decidability and undecidability of two decisio...
متن کاملReachability Problems for PAMs
Piecewise affine maps (PAMs) are frequently used as a reference model to show the openness of the reachability questions in other systems. The reachability problem for one-dimentional PAM is still open even if we define it with only two intervals. As the main contribution of this paper we introduce new techniques for solving reachability problems based on p-adic norms and weights as well as sho...
متن کاملReachability Problems: An Update
There has been a great deal of progress in the fifteen years that have elapsed since Wigderson published his survey on the complexity of the graph connectivity problem [Wig92]. Most significantly, Reingold solved the longstanding question of the complexity of the s-t connectivity problem in undirected graphs, showing that this is complete for logspace (L) [Rei05]. This survey talk will focus on...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2012
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2011.12.056